A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting
Identifieur interne : 006C55 ( Main/Exploration ); précédent : 006C54; suivant : 006C56A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting
Auteurs : Bernd Löchner [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Redundancy criteria are an important means to restrict the search space of a theorem prover. In the presence of associative and commutative (AC) operators saturating provers soon generate many similar equations, most of them are redundant. We present a new criterion that is specialized for the AC-case and leads to significant speed-ups. The criterion uses a new sufficient test for the unsatisfiability of ordering constraints. The test runs in polynomial time, is easy to implement, and covers reduction orderings in a generic way, with possible extensions for LPO and KBO.
Url:
DOI: 10.1007/978-3-540-25984-8_2
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003530
- to stream Istex, to step Curation: 003488
- to stream Istex, to step Checkpoint: 001865
- to stream Main, to step Merge: 006F60
- to stream Main, to step Curation: 006C55
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting</title><author><name sortKey="Lochner, Bernd" sort="Lochner, Bernd" uniqKey="Lochner B" first="Bernd" last="Löchner">Bernd Löchner</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DF792AE0FB8540F145EE61A3799B0E0B99528602</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-25984-8_2</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-CTHD0SBL-P/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003530</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003530</idno><idno type="wicri:Area/Istex/Curation">003488</idno><idno type="wicri:Area/Istex/Checkpoint">001865</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001865</idno><idno type="wicri:doubleKey">0302-9743:2004:Lochner B:a:redundancy:criterion</idno><idno type="wicri:Area/Main/Merge">006F60</idno><idno type="wicri:Area/Main/Curation">006C55</idno><idno type="wicri:Area/Main/Exploration">006C55</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting</title><author><name sortKey="Lochner, Bernd" sort="Lochner, Bernd" uniqKey="Lochner B" first="Bernd" last="Löchner">Bernd Löchner</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB Informatik, Technische Universität Kaiserslautern, Kaiserslautern</wicri:regionArea><placeName><region type="land" nuts="2">Rhénanie-Palatinat</region><settlement type="city">Kaiserslautern</settlement></placeName><orgName type="university">Université technique de Kaiserslautern</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Redundancy criteria are an important means to restrict the search space of a theorem prover. In the presence of associative and commutative (AC) operators saturating provers soon generate many similar equations, most of them are redundant. We present a new criterion that is specialized for the AC-case and leads to significant speed-ups. The criterion uses a new sufficient test for the unsatisfiability of ordering constraints. The test runs in polynomial time, is easy to implement, and covers reduction orderings in a generic way, with possible extensions for LPO and KBO.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Kaiserslautern</li></settlement><orgName><li>Université technique de Kaiserslautern</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Lochner, Bernd" sort="Lochner, Bernd" uniqKey="Lochner B" first="Bernd" last="Löchner">Bernd Löchner</name></region><name sortKey="Lochner, Bernd" sort="Lochner, Bernd" uniqKey="Lochner B" first="Bernd" last="Löchner">Bernd Löchner</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006C55 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006C55 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:DF792AE0FB8540F145EE61A3799B0E0B99528602
|texte= A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting
}}
| This area was generated with Dilib version V0.6.33. |  |